Cache control method and apparatus for storing data in a cache memory and for indicating completion of a write request irrespective of whether a record to be accessed exists in an external storage unit

ABSTRACT

In an information processing system having a data processing apparatus, a control unit for a cache memory, and a storage unit for storing a record, respectively interconnected together, wherein when the control unit receives from the data processing apparatus a write request for a record to be written and if the record to be written is not being stored in the cache memory, the control unit receives a data to be written in the object record from the data processing apparatus and stores the received data in the cache memory. After notifying the data processing apparatus of a completion of a data write process, the control unit checks if the object record in which the data stored in the cache memory is being stored in the storage unit, if the object record is being stored in the storage unit, the data in the cache memory is written in the storage unit, and if not, the data in the cache memory is not written and such effect is notified to the data processing apparatus.

This is a continuation application of U.S. Ser. No. 07/625,154, filedDec. 10, 1990, now abandoned.

BACKGROUND OF THE INVENTION

The present invention relates to a cache control method capable ofspeeding up the write process for writing data from a data processingapparatus into a storage unit by using a cache memory, and a cachecontrol apparatus suitable for practicing the cache control method asabove.

For use with information processing systems having a data processingapparatus, a control unit for a cache memory, and a storage unit,respectively interconnected together, there has been proposed the methodof controlling the writing of data from the data processing apparatusinto the storage unit, as described for example in Japanese Laid-openpublication JP-A-55-157053.

According to a first control method described in this related art, awrite process by the data processing apparatus is terminated when datahave been written in a cache memory. The data stored in the cache memoryare written in the storage unit later at a proper time. This writeprocess is called a write-after process. Data written in the cachememory and not still in the storage unit are called write-after data. Inthe above-mentioned Publication JP-A-55-157053, however, there is notdisclosed detailed technology of the manner of how data received fromthe data processing unit are written in the storage unit.

According to a second control method, the write process by the dataprocessing apparatus is terminated only when data have been written inthe storage unit.

According to a third control method, write data supplied from the dataprocessing apparatus are classified into permanent write data andtemporary write data. The write process for the permanent write data bythe data processing apparatus is terminated only when the data have beenwritten in the storage unit. On the other hand, the write process forthe temporary data by the data processing apparatus is terminated whenthe data have been written in the cache memory, and the temporary dataare never written into the storage unit.

Of the three control methods, the second control method does not use acache memory but directly access the storage unit, and the degree ofusing the cache memory is considerably limited in the third controlmethod. In view of this, only the first control method is substantiallya cache control method that is capable of speeding up the write process.

However, it is difficult to apply the first cache control method forwriting data from the data processing apparatus into a record in thestorage unit if the record is not stored in the cache memory at thattime.

The reason for this is that if at the time of writing data from the dataprocessing apparatus, the corresponding record is not stored in thecache memory, then there is a possibility that the record having arecord number designated by the data processing apparatus side is notstored in the storage unit. Furthermore, if the storage unit stores aduplicate of a record having a record number designated by the dataprocessing apparatus side, it is not possible to determine in whichrecord the data are to be written, thereby preventing a correctwrite-after process.

Thus, the above cache control method is hard to use if a record to bewritten is not stored in the cache memory at the time of writing datafrom the data processing apparatus. Speeding up the write process isthus impossible.

There is disclosed in JP-A-59-135563 a technique for a disc controllerwith a cache memory and a nonvolatile memory. In JP-A-59-15563, the diskcontroller writes the data received from a data processing unit to boththe cache memory and the nonvolatile memory. If the cache memory breaksdown before the write-after data in the cache memory are written to thedisk unit, the write-after data are ensured in the nonvolatile memory.Therefore, the highly reliable write-after process can be realized.However, there is no consideration in the case where a record for whichthe data processing unit issues the write request does not exist in thecache memory.

As described above, with the conventional cache control method, thewrite process can be sped up on condition that a record corresponding todata from the data processing apparatus is being stored in the cachememory at the time of data write, because the write process can beterminated when the data have been stored in the cache memory. However,if a record corresponding to the data is not being stored in the cachememory at the time of data write, it is hard to speed up the writeprocess.

SUMMARY OF THE INVENTION

It is a first object of this invention to provide a cache control methodcapable of speeding up the write process, even if a record to be writtenis not being stored in the cache memory at the time of writing data froma data processing apparatus, by terminating the write process when thedata have been stored in the cache memory.

This invention also aims at providing a cache control apparatus suitablefor practicing the cache control method as above.

In order to further speed up the write process, it is necessary toefficiently execute the write process of write-after data in a storageunit. To this end, it becomes necessary, as will be later described, toknow the physical position of the storage unit relative to thewrite-after data.

It is therefore a second object of this invention to provide a cachecontrol method capable of calculating the physical position of thestorage unit relative to the write-after data when the data have beenstored in the cache memory, even if a record to be written is not beingstored in the cache memory.

This invention also aims at providing a cache control apparatus suitablefor practicing the cache control method as above.

According to the present invention, the following three cache controlmethods are provided in order to achieve the first object of speeding upthe write process even if a record to be written is not being stored ina cache memory.

According to the first cache control method for a control unit for acache memory connected with a storage unit for storing a record, thecontrol unit (a) receives from the data processing apparatus a writerequest for a record to be written; (b) if the record to be written isnot being stored in the cache memory, receives data to be written in theobject record from the data processing apparatus; (c) stores thereceived data in the cache memory; (d) notifies the data processingapparatus of a completion of a data write process; (e) checks if theobject record in which the data stored in the cache memory is beingstored in the storage unit; and (f) if the record is being stored,writes the data stored in the cache memory in the object record of thestorage unit, and if not, the data stored in the cache memory are notwritten and such a result is notified to the data processing apparatus.

According to the second cache control method for a control unit with acache memory connected with a storage unit for storing a record having acontrol field inclusive of a record number, all of which arerespectively interconnected together, the control unit (a) receives fromthe data processing apparatus a write request including recordinformation for designating a record to be written, field informationfor designating a field to be written in the record, and process modeinformation for designating a process mode to be executed when therecord to be written is not being stored in the cache memory; (b)receives from the data processing apparatus data to be written in thedesignated field in accordance with the process mode designated by theprocess mode information if the record to be written by the recordinformation is not being stored in the cache memory and if the field tobe written by the field information does not contain the control field;(c) stores the data in the cache memory; and (d) notifies the dataprocessing apparatus of the completion of a write process.

According to the third cache control method for a control unit with acache memory connected with a storage unit for storing a record having aplurality of physical areas for storing a record having a control fieldinclusive of a record number, the control unit holds, for each physicalarea, record format information indicating whether there is a duplicaterecord number of the record in the physical area, (a) receives from thedata processing apparatus a write request including record informationfor designating a record to be written, and field information fordesignating a field to be written in the record; (b) receives from thedata processing apparatus data to be written in the field designated bythe field information if the record to be written by the recordinformation is not being stored in the cache memory, if the field to bewritten by the field information does not contain the control field, andif the record format is satisfied; (c) stores the data in the cachememory; and (d) notifies the data processing apparatus of the completionof a write process.

Next, the following two cache control methods are provided as the fourthand fifth cache control methods in order to achieve the second object ofmaking it possible to calculate the physical position of a storage unitrelative to the write-after data even when a record to be written is notbeing stored in a cache memory.

According to the fourth cache control method for a control unit for acache memory connected with a storage unit for storing a record having aplurality of physical areas for storing a record having a control fieldinclusive of a record number, the control unit (a) receives from thedata processing apparatus a write request including record informationfor designating a record to be written, field information fordesignating a field to be written in the record, and record formatinformation which indicates whether all of the following are satisfied:the record number of the record at the start of the physical area forstoring records is "0" and the numbers of the following records aregiven in the ascending order each incremented by "one" each record hasone field other than the control field, the length of the field otherthan the control field of each record having the record number 1 orlarger is the same, and the field other than the control field of therecord having the record number 0 has a predetermined length; (b)receives from the data processing apparatus data to be written in thedesignated field if the designated record is not being stored in thecache memory, if the designated field does not contain the controlfield, and if the record format is satisfied; (c) stores the data in thecache memory; and (d) notifies the data processing apparatus of thecompletion of a write process.

According to the fifth cache control method for a control unit for acache memory connected with a storage unit for storing a record having aplurality of physical areas for storing a record having a control fieldinclusive of a record number, the control unit holds, in each physicalarea, record format information indicating whether all of the followingare satisfied: whether the record number of the record at the start ofthe physical area for storing records is "0" and the numbers offollowing records are given in the ascending order each incremented by"one" each record has one field other than the control field, the lengthof the field other than the control field of each record having therecord number 1 or larger is the same, and the field other than thecontrol field of the record having the record number 0 has apredetermined length; (a) receives from the data processing apparatus awrite request including record information for designating a record tobe written, and field information for designating a field to be writtenin the record; (b) receives from the data processing apparatus data tobe written in the designated field if the designated record is not beingstored in the cache memory, if the designated field does not contain thecontrol field, and if the record format is satisfied; (c) stores thedata in the cache memory; and (d) notifies the data processing apparatusof the completion of a write process.

The present invention all contemplates the cache control apparatusprovided with means for practicing the first to fifth cache controlmethods.

According to the first cache control method of this invention, even ifdata to be written and supplied from the data processing apparatus arenot being stored in the cache memory, the data are stored in the cachememory and the completion of the write process is forwarded to the dataprocessing apparatus at this stage. In the above manner, the writeprocess can be sped up irrespective of whether or not data from the dataprocessing apparatus are being stored in the cache memory.

According to the second and fourth cache control methods of thisinvention, upon reception of a write request from the data processingapparatus, data to be written and supplied from the data processingapparatus are stored by a control unit in the cache memory even if thedata are not being stored in the cache memory, and the control unitnotifies the data processing apparatus at this stage of the completionof a write process.

According to the third and fifth cache control methods of thisinvention, if data to be written and supplied from the data processingapparatus are not being stored in the cache memory, the control unitchecks if there is no duplicated record number in the storage unit, andthen stores the data in the cache memory and announces a completion ofthe write process at this stage. Therefore, an occurrence of error inthe case where the data stored in the cache memory are written to thestorage unit can be avoided and the write process can be sped up. Inorder to check a duplicated record number, the data processing apparatusholds therein the information representing whether or not there is aduplicated record number in the storage unit.

According to the fourth and fifth cache control methods of thisinvention, the physical position of the storage unit relative to thewrite-after data can be calculated in accordance with such structuralinformation as the ascending order of record numbers, thereby furtherimproving the efficiency of the write process.

The cache control apparatus embodying the first to fifth cache controlmethods operate in the same manner as described above.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of a control unit according to the firstembodiment of this invention;

FIG. 2 is a block diagram of an information processing system accordingto the present invention;

FIG. 3 shows an example of the structure of the disk unit 24;

FIG. 4 shows an example of the structure of the record 301;

FIG. 5 shows an example of another structure of the record 301;

FIG. 6 shows an example of the structure of the cache memory 26according to the first embodiment of this invention;

FIG. 7 shows an example of the structure of the segment according to thefirst embodiment of this invention;

FIG. 8 shows an example of the structure of the directory 28 accordingto the first embodiment of this invention;

FIG. 9 shows an example of the structure of the segment managementinformation 500 according to the first embodiment of this invention;

FIG. 10 shows an example of the structure of a track table 501 accordingto the first embodiment of this invention;

FIG. 11 illustrates the empty segment queue head pointer 502 accordingto the first embodiment of this invention;

FIG. 12 shows an example of the structure of the write-after memory 27according to the first embodiment of this invention;

FIG. 13 shows an example of the structure of the write-after information1100 according to the first embodiment of this invention;

FIG. 14 shows an example of the structure of the director 25 of thefirst embodiment of this invention;

FIG. 15 is a flow chart illustrating the processes o be executed by thecache partial write part 10 according to the first embodiment of thisinvention;

FIG. 16 is a flow chart illustrating the processes to be executed by thewrite-after schedule part 11;

FIG. 17 is a flow chart illustrating the processes to be executed by thewrite-after transfer part 12 according to the first embodiment of thisinvention;

FIG. 18 is a flow chart illustrating the processes to be executed by thewrite-after error decision part 13;

FIG. 19 is a block diagram showing the fundamental structure of acontrol unit according to a second embodiment of this invention;

FIG. 20 shows an example of the structure of the write-after memory 27according to the second embodiment of this invention;

FIG. 21 shows an example of the structure of the write after trackinformation a 1700 according to the second embodiment of this invention;

FIG. 22 is a state transition diagram of the track state a 1800according to the second embodiment of this invention;

FIG. 23 shows an example of the structure of director 25 according tothe second embodiment of this invention;

FIGS. 24A and 24B are flow charts illustrating the processes to beexecuted by the write-after track information management part a 14according to the second embodiment of this invention;

FIG. 25 is a flow chart illustrating the processes to be executed by thewrite-after information management part b 15 according to the secondembodiment of this invention;

FIG. 26 is a block diagram showing the fundamental structure of thecontrol unit 23 according to a third embodiment of this invention;

FIG. 27 shows an example of the structure of the segment managementinformation 500 according to the third embodiment of this invention;

FIG. 28 shows an example of the structure of the write-after information1100 according to the third embodiment of this invention;

FIG. 29 is a flow chart illustrating the processes to be executed by thecache partial write part 10 according to the third embodiment of thisinvention;

FIG. 30 is a flow chart illustrating the processes to be executed by thewrite-after schedule part 11 according to the third embodiment of thisinvention;

FIG. 31 is a flow chart illustrating the processes to be executed by thewrite-after transfer part 12 according to the third embodiment of thisinvention;

FIG. 32 is a flow chart illustrating the processes to be executed by thewrite-after error decision part 13 according to the third embodiment ofthis invention;

FIGS. 33 and 34 conceptually illustrate the method of efficientlywriting the write-after record 160;

FIG. 35 is a block diagram showing the fundamental structure of acontrol unit 23 according to a fourth embodiment of this invention;

FIG. 36 shows an example of the structure of the write-after memory 27according to the fourth embodiment of this invention;

FIG. 37 shows an example of the structure of the write-after trackinformation b 2800 according to the fourth embodiment of this invention;

FIG. 38 is a state transition diagram of the track state b 2900according to the fourth embodiment of this invention;

FIG. 39 is a flow chart illustrating the processes to be executed by thecache partial write part 10 according to the fourth embodiment of thisinvention;

FIGS. 40A and 40B are flow charts illustrating the processes to beexecuted y the write-after track information management part a 14;

FIG. 41 is a flow chart illustrating the processes to be executed by thewrite-after track information management part b 15 according to thefourth embodiment of this invention;

FIG. 42 shows an example of the relationship between records 301 on thetrack 300 at consecutive positions, and records stored in the segment400 at consecutive positions;

FIGS. 43A, 43B, and 43C show examples of segments 400 used forexplaining the consecutive storage conditions;

FIG. 44 shows an example of the structure of the segment managementinformation 500 according to a fifth embodiment of this invention; and

FIG. 45 illustrates the outline of this invention.

DESCRIPTION OF THE PREFERRED EMBODIMENTS

Preferred embodiments of this invention will be described below.

The embodiments of this invention include first to fifth embodiments.The common elements thereto will first be described with reference toFIGS. 2 to 5.

FIG. 2 is a block diagram showing an information processing systemembodying the present invention.

The information processing system is constructed of a data processingunit 200, a control unit 23, and one or more disk units 24, alloperatively connected to each other.

The data processing unit 200 has a CPU 20, a main storage 21, andchannels 22.

The control unit 23 has one or more directors 25, a cache memory 26, awrite-after memory 27, and a directory 28.

The director 25 performs data transfer between the channel 22 and thedisk unit 24, between the channel 22 and the cache memory 26, andbetween the cache memory 26 and the disk unit 24.

The cache memory 26 is loaded with the data of the disk unit 24 that arefrequently accessed. This load process is executed by the director 25.Particular examples of such data include the data accessed in the pastby CPU 20, the data stored in the disk unit 24 at areas near the dataaccessed by CPU 20, and other data.

The director 28 stores management information for the cache memory 26.

The disk unit 24 has the structure as shown in FIG. 3. Each disk unit 24has a plurality of disks 308, each disk being a medium for storing data.A read/write head 309 for reading/writing data relative to the disk 308is provided for each disk 308.

A circular area accessible by the read/write head 309 while the disk 308rotates once is called a track 300. A plurality of tracks 300 are formedon the disk 308. When the data are read from or written to the track300, the read/write head 309 is moved to the position where the data canbe read/written. This operation is called a seek operation. A requestfor such an operation is called a positioning request. A directorinterface 311 between the disk unit 24 and the director 25 controls theread/write head 309 in accordance with an instruction from the director25.

Sectors 302 are areas formed on the disk 308 at predetermined angularintervals from a reference position 303 of the disk 308. This referenceposition 303 is called a home index 303. The sector 302 starting fromthe home index 303 is called a basic sector 304 (sector 0). The numberof each sector 302 is incremented by one from the basic sector 304 inthe direction opposite to the rotation of the disk 308.

The read/write head 309 identifies the sector 302 positioned under it.

Immediately after the home index 303, there is formed an area whichstores control information for the track 300. This area is called a homeaddress 306.

Each track 300 has one or more records 301. Each record 301 is a unit ofdata read from or written to the disk unit 24 by the director 25.

A gap 305 is formed between adjacent records 301. The gap 305 betweenthe records 301 is called a gap a 305 in order to discriminate from agap b 605 (refer to FIGS. 4 and 5) to be described later.

Each record 301 may have a different length. The length of each gap a isthe same.

Generally, the record 301 immediately after the home address 306 storesnot general data, but control data to be used by the CPU 20 side.Therefore, this record is called a control record 310.

FIGS. 4 and 5 show examples of the structure of a record 301. In theexample shown in FIG. 4, the record 301 is constructed of three fields606 including a control field 600, a key field 607, and a data field601. In the example shown in FIG. 5, the record 301 is constructed oftwo fields 606 including a control field 600 and a data field 601.

A gap 605 is formed between the control field 600 and the key field 607,and between the key field 607 and the data field 601. This gap 605 iscalled the gap b 605. The length of each gap b 605 is the same.

The control field 600 records control information including a recordnumber 602, a key field length 608, a data field length 603 and thelike. The record number 602 is a discriminator for the record 301. Thekey field length 608 and data field length 603 represent the length ofthe key field 607 and the data field 601, respectively. If the record301 has no key field 607 as shown in FIG. 5, the key field length 608 isset to 0. The length of the control field 600 is generally fixed.

The data field 601 holds information to be processed by a programrunning in CPU 20.

The key field 607 holds key information which checks the right of accessto the contents of the data field 601.

A write process generally includes a format write process and a partialwrite process. The former process is for altering all the fields 606inclusive of the control field 600, and the latter process is foraltering the fields excepting the control field 600. The executionfrequency of the format write process is not so high and not necessaryto speed up because it is executed only when a whole file is made forthe first time. The execution frequency of the partial write process ishigh so that it should be sped up. Therefore, this invention mainlyrelates to a partial write.

The data field length 603 and key field length 608 are presented withinthe control field 600. Therefore, with the partial write process, thecontents of the data field 601 and the key field 607 change, but thelength in the control field 600 maintains unchanged.

The process outline of the present invention will be given.

FIG. 45 shows the outline of the operation of each processing unit,i.e., the outline of this invention. A cache partial write part 10 firstreceives a partial write request from CPU 20 via the channel 22. In thiscase, even if a record to be written is not present in the cache memory26 (even if a record 301 having a record number 602 designated by CPU 20for data write is not present in the cache memory 26), the cache partialwrite part 10 executes the following cache write process. Namely, datato be written in the record 301 designated by CPU 20 are stored in thecache memory 25 as write-after data 29. After completion of datastorage, a completion of the partial write request is notified to theCPU 20 side.

Next, a write-after schedule part 11 determines the track 300 of thedisk unit 24 with respect to which the write-after process is to beexecuted, and issues a positioning request to the disk unit 24.

After completion of the positioning process, a write-after transfer part12 finds a record 301 in which the write-after data 29 stored in thecache memory 26 are to be stored (i.e., the part 12 finds the record 301having the record number 602 designated by CPU 20). If the record isfound, there is executed the write-after process for writing thewrite-after data 29 in the record 301. If not, the write-after processis not executed, but "record number inconsistent" information 1203 inwrite-after information 1100 is set to thereby register an occurrence ofan error.

Lastly, a write-after error decision part 13 refer to the "record numberinconsistent" information 1203 to notify the CPU 20 that the record 301to be written with the write-after data 29 was not found in the diskunit 24. In the following embodiments, the write-after error decisionpart 13 sends such an error notice to CPU 20 when the former receives aread/write request from the latter. However, the timings of giving suchan error notice are not limited thereto, but other timings may also beused. For example, an error notice may be given to CPU 20 immediatelyafter the write-after transfer part 12 sets the "record numberinconsistent" information 1203 in the write-after information 1100.

Next, the first embodiment of this invention will be described withreference to FIGS. 1 and 6 to 18. In the first embodiment, if a record301 to be written is not present in the cache memory 26, and only whenthe director 25 receives a particular process mode designated by CPU 20,the director 25 terminates the write process when the data have beenwritten in the cache memory 26.

FIG. 1 is a diagram illustrating in detail the information processingsystem of the first embodiment.

The director 25 receives the following designated information a 100 fromCPU 20 via the channel 22 during the course of executing the partialwrite process.

Designated Information 1 . . . for designating the disk unit 24 and thetrack 300 storing the record 301 to be written.

Designated Information 2 . . . for designating the sector 302 of thetrack 300 from which the record 301 to be written is searched.

Designated Information 3 . . . for designating the record number 602 ofthe record 301 to be written.

Designated Information 4 . . . for designating the field 606 to bewritten.

Designated Information 5 . . . for designating a process mode when therecord 301 to be written is not being stored in the cache memory 26.Namely, when CPU 20 recognizes that there is no duplicated record number602 in the track 300 designated by the designated information 1, thisprocess mode is designated for terminating the write process when thedata have been written in the cache memory 26.

Thus, the execution condition a 110 of this cache write operationaccording to this invention is that the record 301 to be written is notbeing stored in the cache memory 26, the field to be written does notcontain the control field 600, and the process mode designated by thedesignated information 5 has been received.

In the cache write operation 120, the director 25 receives data from thechannel 22 (step 121), and writes the received data in the cache memory26 (step 122). A notice of write process completion is given via thechannel 22 to CPU 20 (step 123).

Data stored in the cache memory 26 and not written in the disk unit 24is called write-after data 29.

The director 25 manages the record 301 which stores the write-after data29, as a write-after record 160.

The director 25 writes the write-after data 29 in the disk unit 24 byusing an idle time of the director 25. This operation is called awrite-after operation.

In a write-after operation a 130, the director 25 finds the record 301on the disk unit 24 where the write-after data 29 are written.Specifically, the director 25 finds the record 301 having the recordnumber 602 designated by the designated information 3 within the track300 of the disk unit 24 designated by the designated information 1 and2.

If the object record 301 has been found, the director 25 executes awrite-after operation b 140 to write the write-after data 29 in therecord 301.

If the object record 301 is not found, the director 25 executes awrite-after operation c 150 not to write the write-after data 29, andnotifies the CPU 20 of such a situation as will be described later.

FIG. 6 shows the structure of the cache memory 26 of this embodiment.

The cache memory 26 is constructed of a number of segments 400.

Each segment 400 can store all records 301 of one track 300. Aconventional method may be used as a method of determining which segment400 is allocated to which track 300. An empty segment 400 may be presentwhich has not been allocated with the track 300.

FIG. 7 shows the storage format of the write-after data 160 within thesegments 400.

Since the data in the control field 600 are not changed at the partialwrite process, the director 25 does not receive the control field 600from the channel 22. Thus, if the record 301 to be written is not beingstored in the cache memory 26 and the supplied data have been written,the director 25 forms a dummy control field 1000 in the cache memory 26.

The designated record number 602 from the channel 22 is stored in thedummy record field 1000. Also stored in the dummy record field 1000 isthe length of the data to be written in the designated field 606 andsupplied from the channel 22. If the contents of the key field 607 andthe data field 601 are to be changed, the length of the data for therespective fields is set as the key field length 608 and data fieldlength 603. If the contents of the data field 601 only are to bechanged, 0 is set as the key field length 608. In the followingdescription, the key field length 608 and data field length 603 arecollectively called a field length 609.

For writing the write after record 160 in the record 301 of the diskunit 24, the director 25 determines whether or not the write-afterprocess is to be executed by comparing the record number 602 and fieldlength 609 in the control field 600 of the record 301 on the disk unit24 with the corresponding record number 602 and field length 609 in thedummy control field 1000.

If the record 301 to be written is being stored in the cache memory 301,the control field 600 has been already stored in the segment 400 so thatthe dummy control field 1000 is not formed.

After the dummy control field 1000 or control field 600, there arestored a key field pointer 1001, a data field pointer 1002, and a dummycontrol field flag 1003.

The key field pointer 10001 and data field pointers 1002 are pointers tothe key field 607 and data field 601 stored in the cache memory 26,respectively. The reason for providing these pointers is that there is acase where areas for storing one write-after record 160 are notconsecutive. An example of such a case will be described in thefollowing.

When the director 25 receives the partial write request for only thedata field 601 of the record 301 not stored in the cache memory 26, anarea for storing the key field 607 cannot be established because thelength of the key field 607 cannot be known. Therefore, the key fieldlength 608 is set to 0. Thereafter, it is assumed that there is receivedthe partial write request for changing the contents of both the keyfield 607 and the data field 601. In this case, the length of the keyfield 607 is known so that the area for the key field 607 is establishedat this stage. Accordingly, as shown in FIG. 7, the area for the keyfield 607 is established at the position remote from the write-afterrecord 160 containing the dummy control field 1000, so that the areasfor storing one write-after record 160 are not contiguous.

The dummy control field flag 1003 is turned on when the director 25 hasgenerated the dummy control field 1000, whereas it is turned off whenthe director 25 has loaded the record 301 from the disk unit 24 to thecache memory 26.

FIG. 8 shows information provided within the directory according to thisembodiment. The information includes segment management information 500,a track table 501, and an empty segment queue head pointer 502. Thesegment management information 500 is provided for each segment 400. Onetrack table 501 and one empty segment queue pointer 502 are providedwithin the directory 28.

FIG. 9 shows the following information provided as the segmentmanagement information 500 according to this embodiment.

An empty segment pointer 800 . . . a pointer to the segment managementinformation 500 for another empty segment 400.

A partial write flag 801 . . . a flag indicating that the write afterdata 29 written upon the partial write request are being stored in thesegment 400 corresponding to the segment management information 500 ofconcern.

A cached track number 805 . . . the number of the track 300 stored inthe segment 400 corresponding to the segment management information 500of concern.

A record pointer 806 . . . a pointer to the record 301 stored in thesegment 400 corresponding to the segment management information 500 ofconcern. For example, the n-th record pointer 806 is a pointer to therecord 301 having the record number 602 (n-1). If the record 301 havingthe record number 602 (m-1) is not being stored in the cache memory 26,the m-th record pointer 806 takes a null value. In this example, it isassumed that the top record pointer 806 is a pointer to the record 301having the record number 0. The number of record pointers 806 is as manyas the number of record numbers 602 which can be defined within onetrack 300.

An update record pointer 807 . . . a pointer to the write-after record160 stored in the segment 400 corresponding to the segment managementinformation 500 of concern. In this case, even if the partial writeprocess is for the record 301 already stored in the cache memory 26, thedirector 25 manages this record 301 as the write-after record 160.Similar to the record pointer 806, the n-th update record pointer 807 isa pointer to the record 301 having the record number 602 (n-1). If therecord 301 having the record number 602 (m-1) is not a write-afterrecord 160, the m-th update record pointer 807 takes a null value. Thenumber of update record pointers 807 is also as many as the number ofrecord numbers 602 which can be defined within one track 300.

Update field information 808 . . . information indicating the updatedfield 606 in the write-after record 160 having the record number n.Namely, the information indicates which combination of the record field600, key field 607, and data field 601 constitutes the updated field.The number of update field information 808 is also as many as the numberof record numbers 602 which can be defined within one track 300.

An intra-segment empty area address 809 . . . an address indicating thestart address of an empty area not storing the record 301 within thesegment 400 corresponding to the segment management information 500 ofconcern.

A segment pointer 810 . . . a pointer to the segment within the cachememory 26 corresponding to the segment management information 500 ofconcern.

FIG. 10 shows the structure of the track table 501. The track table 501stores information regarding whether or not each track of all disk units24 is assigned the segment 400. If the segment is assigned to the track,the information of the track table 501 is a pointer to the segmentmanagement information 500 corresponding to the assigned segment. Ifnot, the information takes a null value. In the track table 501, theinformation of the tracks 300 of the same disk unit 24 is stored insequential order by track number.

As shown in FIG. 11, the segment management information 500 for theempty segments 400 is first identified by the empty segment queue headpointer 502 and then sequentially interconnected by the empty segmentpointers 800 for the corresponding segment management information 500.

FIG. 12 shows the structure of the write-after memory 27 which storeswrite-after information 1100 for each disk unit 24. The write-afterinformation 1100 includes information representative of an executionstate of the write-after process, and error information.

FIG. 13 shows the contents of write-after information 1100. The contentsof write-after information 1100 will be described below.

A write-after processing flag 1200 . . . a flag indicating if the diskunit 24 corresponding to the write-after information 1100 of concern isexecuting the write-after process.

A write-after segment pointer 1202 . . . a pointer to the segmentmanagement information 500 corresponding to the track 300 subjected tothe write-after process.

"Record number inconsistent" information 1203 . . . informationrepresentative of the record number 602 of the record 301 subjected tothe write-after process, the record 301 being not stored in the diskunit 24.

"Field length inconsistent" information 1204 . . . informationrepresentative of the field 606 subjected to the write-after process,the length of the field 606 being inconsistent.

If the "record number inconsistent" information 1203 of "field lengthinconsistent" information 1204 is present, an error has occurred duringthe write-after process. An error may occur because of other reasons.However, since such an error is not directly associated with the presentinvention, the description therefor is omitted.

The above information may be erased by power failure or the like so thatthe information is preferably stored in a non-volatile manner.

FIG. 14 shows the structure of the director 25 according to thisembodiment. Each part will be described below.

A cache partial write part 10 . . . upon reception of a partial writerequest, it transfers data received from the channel 22 to the cachememory 26.

A write-after schedule part 11 . . . it determines the disk unit 24 andtrack 300 to be subjected to the write-after process.

A write-after transfer part 12 . . . it executes the write-after processscheduled by the write-after schedule part 11.

A write-after error decision part 13 . . . upon reception of aninput/output request from CPU 20, it checks if there occurs an error athe disk unit 24 to which the request was directed, in the write-afterprocess. If an error occurs, such a situation is sent via the channel 22to CPU 20.

The operation of each part will be described below.

FIG. 15 is a flow chart illustrating the processes to be executed by thecache partial write part 10. This process flow includes also a processfor the case in which the record 301 to be written is already stored inthe cache memory 26. This process flow is executed when the director 25receives a partial write request from CPU 20 via the channel 22, thepartial write request including the designated information 5 fordesignating a process mode by which even if the record 301 to be writtenis not being stored in the cache memory 26, the write process iscompleted when the data have been stored in the cache memory 26.

At step 1300, it is checked if the segment 400 has already beenallocated to the track 300 to be written. This check relies on the tracktable 501 corresponding to the track 300 of concern. If the segment 400is not still allocated, the process flow advances to step 1301. Ifalready allocated, the process flow jumps to step 1305.

At step 1301, the segment 400 and segment management information 500 areallocated to the track 300 of concern. The allocation method may be aknown method.

At step 1302, the allocated segment information 500 is initialized. Thisinitialization includes, for example, a process of setting the tracknumber of the track 300 to be written as the cached track number 805.

At step 1303, by using the record number designated by the designatedinformation 3, the dummy control field 1000 is formed.

At step 1304, the data received from the channel 22 are stored in thearea corresponding to the field 606 designated by the designatedinformation 4. Thereafter, the process flow advances to step 1311.

At step 1311, the necessary portion of the segment managementinformation 500 is updated, and a completion of the write process isnotified to CPU 20 via the channel 22 to thereafter terminate the writeprocess.

On the other hand, if affirmative at step 1300, it is checked at step1305 if the record 301 to be written is actually stored in the cachememory 26. This is carried out by referring to the segment managementinformation 400 and checking whether or not the record pointer 806 tothe record number 602 of concern takes a null value. If the record 301to be written is not actually stored in the cache memory 26, the processflow jumps to step 1303 and thereafter, executes as for the case wherethe segment 400 has not been allocated to the track 300 to be written.If the record 301 to be written is actually stored in the cache memory26, the process flow advances to step 1306.

At step 1306, it is checked if all the field 606 designated by thedesignated information 4 from CPU 20 are stored in the cache memory 26.If they are stored, the process flow advances to step 1308. If not, theprocess flow advances to step 1307.

At step 1307, it is checked if the dummy control field flag 1003 for therecord 301 to be written is on or off. If off, it means that the record301 to be written was loaded in the cache memory 26 from the track 300.Therefore, this case contradicts the check results at step 1306 that allthe field 606 have been stored. The process flow therefore jumps to step1313 to issue an error notice. If the dummy control field flag 1003 ison, then the process flow advances to step 1312.

At step 1312, the data received from the channel 22 are stored in theareas corresponding to the field 606 already stored and newlyestablished. The length of the data newly stored in the cache memory 26is stored as the key field length 608 or data field length 603 withinthe dummy control field 1000. A proper value is set to the key fieldpointer 1001 or data field pointer 1002. Thereafter, the process flowadvances to step 1309.

On the other hand if affirmative at step 1306, the data received fromthe channel 22 are stored in the cache memory 26 at the areacorresponding to the field 606.

At step 1309 it is checked if the stored data in the cache memory 26 atthe area corresponding to the field 606 are consistent with the keyfield length 608 or data field length 603 within the control field 600.If consistent, the process flow advances to step 1311. If not, theprocess flow 1310 advances to step 1310.

At step 1310, the data length inconsistency is announced to CPU 20 viathe channel 22 to thereafter terminate the process.

On the other hand if negative at step 1307, the director 25 notifies theCPU 20 via the channel 22 at step 1313 of the fact that there iscontradiction with respect to the field 606 to be written to thereafterterminate the process.

FIG. 16 is a flow chart illustrating the processes to be executed by thewrite-after schedule part 11. This process flow includes also a processof writing in the disk unit 24 the write-after data 29 contained in therecord 301 stored in the cache memory 26.

This process flow is executed by the director 25 during the idle time.Namely, upon reception of a partial write request, the data stored inthe cache memory are written in the disk unit 24.

The disk unit 24 to be written is the disk unit of which the write-afterprocessing flag 1200 is off and to which an input/output request is notacknowledged. The track 300 to be written in the write-after process isa track corresponding to the segment management information 500 whosepartial write flag 801 is on.

First at step 1400, the write-after processing flag 1200 of thewrite-after information 1100 of the disk unit 24 to be operated isturned on, and a pointer to the segment management information 400 forthe track 300 to be written is set as the write-after segment pointer1202.

At step 1401, a positioning request for the track 300 to be written issupplied to the disk unit 24 to be operated, to thereafter terminate theprocess flow.

FIG. 17 is a flow chart illustrating the processes to be executed by thewrite-after transfer part 12. This process flow includes also a processof writing in the disk unit 24 the write-after data contained in therecord 301 stored in the cache memory 26.

This process flow is executed after the positioning request for the diskunit generated by the write-after schedule part 11 has been completelycarried out.

At step 1500 it is checked if all the write after records 160 have beencompletely written in the object track 300. If there is no null value inall the update record pointers 807 in the segment management information500 pointed by the write-after segment pointer 1202, it means that thewrite-after record 160 has been completely written. If there is a nullvalue, it means that all the write-after record 160 is not written. Ifcompleted, the process flow jumps to step 1509. If not, the process flowadvances to step 1501.

At step 1501, the record 301 of the track 300 is searched while storingthe physical position of the track 300 from which the search started.The stored physical position is used to check one revolution of thetrack 300.

At step 1502, the control field 600 of the record 301 on the track 300is read.

At step 1503, the record number 602 within the read-out control field600 is compared with the record number 602 within the dummy controlfield 1000 or control field 600 pointed by the update record pointer807. If both the record numbers 602 are coincident, it means that therecord 301 now accessed is to be used for the write-after process sothat the process flow advances to step 1504. If not, the process flowadvances to step 1507.

At step 1504, the field 606 to be written is detected by using theupdate field information 808 corresponding to the update record pointer807. The length of the detected field 606 is derived from the key fieldlength 608 or data field length 603 within the dummy control field 1000or control field 600. The derived length is compared with the key fieldlength 608 or data field length 603 within the control field 600 readfrom the track 300 at step 1502, to check if they are coincident. If notcoincident, the process flow advances to step 1506 without writing thedata. If coincident, the process flow advances to step 1505. At step1505, the write-after data 29 for the field 606 to be written is readfrom and written in the accessed record 301 on the track 300 tothereafter return to step 1500.

At step 1506, there is set the "field length inconsistent" information1204 of the write-after information 1100 to thereafter advance to step1510.

At step 1507 it is checked if the record 301 to be written has undergoneone revolution in the search for the track 300. If not, the process flowreturns to step 1502 to continue the search. If one revolution has beencompleted, the process flow advances to step 1508.

At step 1508, there is set the "record number inconsistent" information1203 to thereafter advance to step 1510.

At step 1509, the segment management information 400 is updated, whichhas become necessary upon completion of the write-after process.

At step 1510 the write-after processing flag 1200 is reset to thereafterterminate the process flow.

FIG. 18 is a flow chart illustrating the processes to be executed by thewrite-after error decision part 13.

This process flow is executed when an input/output request is receivedfrom CPU 20 via the channel 22.

It is checked at step 1600 whether or not there is being set the "recordnumber inconsistent" information 1203 or "field length inconsistent"information 1204 of the write-after information 1100 for the object diskunit 24. If neither the inconsistent information 1203 nor 1204 is beingset, the process flow terminates. If at least one of the inconsistentinformation 1203 or 1204 is being set, then the process flow advances tostep 1601.

At step 1601, an error notice is given to CPU 20 to thereafter terminatethe process flow.

Next, the second embodiment will be described with reference to FIGS. 19to 25. According to this embodiment, in the case where the record 301 tobe written is not being stored in the cache memory 26, the director 25executes a check operation based on the information held in the controlunit 23 and the write process is completed when the data have beenwritten in the cache memory 26.

FIG. 19 is a detailed block diagram showing the information processingsystem of this embodiment. The different points of this embodiment fromthe first embodiment shown in FIG. 1 are as follows. First, thewrite-after memory 27 stores write-after track information a 1700indicating whether or not each track 300 contains a duplicated recordnumber. Second, the designated information b 3300 from CPU 20 does notcontain the designated information 5 which designates a process mode forthe case where the record to be written 301 is not being stored in thecache memory 26. Third, the execution condition b 3310 of the cachewrite operation 120 contains a condition that the track 300 to bewritten does not contain a duplicated record number. The other structureis the same as the first embodiment shown in FIG. 1. The followingdescription is given while paying attention mainly to the differentpoints from the first embodiment.

FIG. 20 shows the structure of the write-after memory 27 of thisembodiment. The difference from the write-after memory 27 of the firstembodiment shown in FIG. 12 resides in that the write-after memory 27 ofthis embodiment stores the write-after track information a 1700 providedfor each disk unit 24.

FIG. 21 shows the structure of the write-after track information a 1700.The write-after track information a 1700 includes track stateinformation a 1800 representative of one of three states, a state thatthere is no duplicated record number, a state that there is a duplicatedrecord number, and a state that it is not certain if there is aduplicated record number. The track state a 1800 of each track 300 isstored in the order of track number.

FIG. 22 shows a state transition of the track state a 1800. The trackstate a 1800 initially takes a state 391 that it is not certain if thetrack 300 has a duplicated record number. Upon reception of a partialwrite request in this state 391, the director 25 checks if the track 300has a duplicated record number or not. If there is no duplicated recordnumber, the track state a 1800 is set to a state 392 that there is noduplicated record number. If there is a duplicated record number, thetrack state a 1800 is set to a state 393 that there is a duplicatedrecord number. If a format write request is received, the director 25causes the track state a 1800 to take the state 391 that it is notcertain if there is a duplicated record number or not. The reason forthis is that there is a possibility that the record number 602 of therecord may be changed by the format write process.

The cache memory 26, storage format of the segment 400, directory 28,segment management information 500, track table 501, and empty segmentqueue head pointer 502 all have the same structure as the firstembodiment, respectively shown in FIGS. 6, 7, 8, 9, 10, and 11.

FIG. 23 shows the structure of the director 25 of this embodiment. Thedifferent points from the director 25 of the first embodiment shown inFIG. 1 are that the director 25 of this embodiment has the following twoparts.

A write after track information management part a 14 . . . this partoperates in the following manner. When a partial write request isreceived for the track 300 whose track state a 1800 takes the state 391that it is not certain if the track 300 has a duplicated record numberor not, this part checks if the track 300 has a duplicated record numberor not, and the check result is stored as the track state a 1800.

A write-after track information management part b 15 . . . this partoperates in the following manner. When a format write request isreceived for the track 300, this part causes the track state a 1800 ofthe track 300 to take the state 391 that it is not certain if there is aduplicated record number or not.

The process flows for the cache partial write part 10, write-afterschedule part 11, write-after transfer part 12, and write-after errordecision part 13 are the same as those shown in FIGS. 15 to 18, exceptthat the flow process of the cache partial write part 10 becomesexecutable in a manner different from the first embodiment. Namely, inthis embodiment, the flow process of the cache partial write part 10 isallowed to be executed only when the track state a 1800 of the track 300to be subjected to the partial write request from CPU 20 takes the state392 that there is no duplicated record number.

FIGS. 24A and 24B are flow charts to be executed by the write-aftertrack information management part a 14.

The process flow shown in FIG. 24A is allowed to be executed when thedirector 25 receives a partial write request for the track 300 whosetrack state a 1800 takes the state 391 that it is not certain if thereis a duplicated record number.

At step 2000, a positioning request is issued to the track 300 to whichthe partial write request was directed, to thereafter terminate theprocess flow.

The process flow shown in FIG. 24B is allowed to be executed when thepositioning request issued at step 2000 has been completed.

At step 2001, it is checked if there is a duplicated record number, byreading all records 301 in the track 300 to which the partial writerequest was directed.

At step 2002, the check result is stored in the track state a 1800 ofthe track 300 of concern, to thereafter terminate the process flow.

FIG. 25 is a flow chart to be executed by the write-after trackinformation management part b 15.

This process flow is allowed to be executed when the director 25receives a format write request.

At step 2100, the track state a 1800 of the track 300 to be subjected tothe format write process is caused to take the state 391 that it is notcertain if there is a duplicated record number or not, to thereafterterminate the process flow.

The third embodiment will be described next with reference to FIGS. 26to 34. According to the third embodiment, if the record 301 to bewritten is not being stored in the cache memory 26 and only whenspecific designated information is received from CPU 20, the data arewritten in the cache memory 26 and the write process is completed atthis stage. Moreover, the efficiency of the write-after process isintended to be improved by calculating the physical write position onthe track 300 of the record 301 to be written.

In the following there will be described the reason why the write-afterprocess efficiency is improved by calculating the physical writeposition.

As shown in FIG. 33, the write efficiency can be improved if a pluralityof write-after records 160 are written in records 301 below theread/write head 309 at physical write positions disposed sequentially inthe direction opposite to the direction of rotation of the disk 308.Furthermore, as shown in FIG. 34, in the case where two physical writepositions are spaced apart by a predetermined distance or more, theefficiency can be further improved if the write-after process isintercepted between the two write-after records 160 because waste timeto be occupied by the director 25 and data transmission lines iseliminated.

FIG. 26 is a detailed block diagram showing the information processingsystem of this embodiment. The different points from the firstembodiment shown in FIG. 1 are as follows.

First, the designated information 3400 from CPU 20 has not thedesignated information 5, but has designated information 6 and 7.

The designated information 6 designates the write data amount. If thereis only one field to be written, the length of this field 606 is used asthe write data amount. When the director 25 receives the designatedinformation 6 from CPU 20, the physical write position on the track ofthe record 301 to be written can be calculated before the director 25receives the data from the channel 22. The designated information 6 neednot always be provided, so the designated information 6 is shown betweenparentheses in FIG. 26.

The designated information 7 is the information indicating that thetrack 300 to be written satisfies the following structural conditions Ato C.

Condition A . . . The record numbers 602 of the records 301 on the track300 to be written are given in the ascending order starting from therecord number "0" of the control record 310, each incremented by "1".

Condition B . . . The field 606 other than the control field 600contains only the data field 601, and the length of the data field 601of the record 301 other than the control record 310 is the same for eachrecord within the same track.

Condition C . . . The control record 310 is a standard record. Namely,the field 606 other than the control field 600 of the control record 310contains only the data field, and the length of the data field has apredetermined standard length.

If the structural conditions A to C are satisfied, it becomes possibleto calculate the physical write position on the track 300 of the record301.

The reason why the physical write position can be calculated is asfollows.

If the condition A is satisfied, it is possible to know where the record301 to be written from the start of the track 300 is, based upon therecord number 602 from the channel 22 received by the director 25. Ifthe conditions B and C are then satisfied, it is possible to know thelength of the field 606 of each record 301 on the track 300, based uponthe length of the data received from the channel 22 or the write dataamount contained in the designated information 6. With theabove-described information, it is possible to calculate the physicalposition on the track 300 of the record 301 to be written.

Whether or not the track 300 to be written satisfies the conditions A toC is provided to the control mechanism within CPU 20. Thus, CPU 20 cangenerate the designated information 7.

Another different point from the first embodiment is that the executioncondition c 3410 of the cache write operation 120 is satisfied if thetrack 300 to be written satisfies the conditions A to C.

The following is still another different point from the first embodimentwith respect to the operation of writing the write-after data 29 intothe disk unit 24.

Specifically, for the write-after operation d 3420, the director 25checks if the record 301 having the record number 602 supplied from thedesignated information 3 is present near or within a predetermineddistance from the calculated write position of the record 301 on thetrack 300 of the disk unit 24. Scanning the record near thepredetermined distance from the calculated write position is executedbecause the physical position of the record 301 will be displaced tosome degree if a faulty record unable to be read/written is present onthe track 300.

The cache memory 26, directory 28, track table 501, empty segment queuehead pointer 502, and write-after memory 27 all have the same structureas the first embodiment, respectively shown in FIGS. 6, 8, 10, 11, and12.

The dummy control field 1000, the key field pointer 1001, data fieldpointer 1002, and dummy control field flag 1003 of the segment 400 haveall the same structure as the first embodiment shown in FIG. 7.

However, the key field 607 is not present in the record 301 of the track300 satisfying the conditions A to C, so that the key field length 608of the dummy control field 1000 is always "0", and the key field pointer1001 always takes a null value. Moreover, the field 606 to be subject tothe partial write process contains only the data field 601, so that thedummy control field 1000, key field pointer 1001, data field pointer1002, dummy control field flag 1003, and data field 601 are all storedin consecutive areas.

FIG. 27 shows the structure of the segment management information 500 ofthis embodiment. The difference from the first embodiment shown in FIG.9 resides in that the segment management information 500 of thisembodiment includes the following information.

A write position calculation possible bit 2200 . . . This bit indicateswhether or not the track 300 of the segment management information ofconcern satisfies the conditions A to C.

A fixed data field length 2201 . . . This length is representative ofthe fixed length of the data field 601 of the record 301 other than thecontrol record 310.

FIG. 28 shows the structure of the write-after information 1100. Thedifference from the first embodiment shown in FIG. 13 resides in thatthe write-after information 1100 of this embodiment includes thefollowing information.

A write-after start record number 2300 . . . In this embodiment, if thepositions of two write-after records 160 on the track 300 are spaced bya predetermined distance or more, the data transfer to the disk unit 24is intercepted and the positioning process is executed to improve theefficiency of the write-after process. Therefore, the record number 602of the write-after record 160 is set as this write-after start recordnumber.

"Record physical position inconsistent" information 2301 . . . Thisinformation is set if the record 301 is not present at the calculatedphysical position.

The structure of the director 25 is similar to the first embodimentshown in FIG. 14, and is constructed of the cache partial write part 10,write-after schedule part, 11, write-after transfer part 12, andwrite-after error decision part 13. The process flow for each part isdifferent from the first embodiment, which will be described below.

FIG. 29 is a flow chart illustrating the processes to be executed by thecache partial write part 10. Similar to the process flow of the firstembodiment, this process flow includes also a process for the case wherethe record 301 to be written is already stored in the cache memory 26.

This process flow is executed when a partial write request is receivedtogether with the information that the track 300 to be written satisfiesthe conditions A to C.

This process flow will now be described below while paying attentionmainly to the different points from the first embodiment shown in FIG.15.

At step 2400, the physical position of the record 301 on the track 300is calculated in accordance with the record number received from thedesignated information 3 and the write data amount received from thedesignated information 6.

At step 2401, it is checked if the range determined by the calculatedphysical position is within the capacity of one track 300. If not, theprocess flow advances to step 2412, and if the range is within thecapacity, it advances to step 2402.

At step 2402, it is checked if the segment 400 has been allocated to thetrack 300 to be written. If already allocated, the process flow advancesto step 2407, and if not, it advances to step 2403.

At steps 2403 and 2404, the track 300 to be written is allocated withthe segment 400 and segment management information 500, and the segmentmanagement information is initialized. These processes are similar tothose at steps 1301 and 1302 shown in FIG. 15.

The processes at the steps 2405 and 2406 are executed when a partialwrite request is received for the record 301 not present in the cachememory 26. These processes are similar to those at steps 1303 and 1304shown in FIG. 15. After the process at step 2406, the process flowadvances to step 2411.

At step 2407, it is checked if the validity of the write data amountreceived from the designated information 6 can be checked or not.Namely, it is checked if the director 25 can check the write data amountdesignated by CPU 20.

If the record to be written is the control record 310, the data fieldlength 602 of the control record 310 on the track 300 has a specificreference value because of the condition C. It is therefore possible tocheck the validity of the write data amount by comparing the write dataamount designated by CPU 20 with the reference value of the data field601 of the control record 310.

If the record 301 to be written is a record other than the controlrecord 310, the data field length 602 of each record 301 other than thecontrol record 310 is the same because of the condition B. Therefore, ifat least one record 301 other than the control record is stored in thecache memory 26, then it is possible to check the validity by comparingthe write data amount designated by CPU 20 with the data field length ofthe record 301 other than the control record stored in the cache memory26.

If the validity check is not possible, the process flow jumps to step2409, and if possible, it advances to step 2408.

At step 2408, the validity of the write data amount is checked. If thewrite data amount is not valid, the process flow jumps to step 2412 inorder to notify an error to CPU 20. If the write data amount is valid,the process flow advances to step 2409.

At step 2409, it is checked if the record 301 to be written is beingstored in the cache memory 26. This step is similar to step 1305 shownin FIG. 15. If the record 301 is not being stored, the process flowadvances to step 2405, and if stored, it advances to step 2410.

At step 2410, the data received from the channel 22 is written in thedata field 601 of the cache memory 26.

At step 2411, necessary information of the segment managementinformation 500 is updated, and a completion of the write process isnotified to CPU via the channel 22, to thereafter terminate the processflow.

At step 2412, CPU 20 is notified via the channel 22 of the fact that thewrite data amount is not valid, to thereafter terminate the processflow.

FIG. 30 is a flow chart illustrating the processes to be executed y thewrite-after schedule part 11.

This process flow is executed during the idle time of the director 25.

The process at step 2500 is similar to that at step 1500 of the firstembodiment shown in FIG. 16.

At step 2501, the smallest record number 602 whose update record pointer807 does not take a null value is searched from the segment managementinformation 500 corresponding to the object track 300, and set in thewrite-after start record number 2300. Since the write-after record 160is selected in order starting from the smaller record number 602 becauseof the condition A, the write process can proceed in the directionopposite to the rotation direction of the disk 308 thereby improving thewrite process efficiency.

At step 2502, a positioning request for the track 300 to be written isissued to the corresponding disk unit 24.

FIG. 31 is a flow chart illustrating the processes to be executed by thewrite-after transfer part 12.

This process flow is executed when the positioning request issued to thedisk unit 24 at step 2502 shown in FIG. 30 has been completed.

At step 2600, the write-after record 160 pointed by the update recordpointer 807 corresponding to the write-after start record number 2300 isselected as the write-after record to be first written.

At step 2601, the physical write position on the track 300 of thewrite-after record 160 corresponding to the update record pointer 807 iscalculated.

At step 2602, it is checked if the record 301 is being stored within apredetermined range of the calculated physical position. If the record301 is not being stored, the process flow advances to step 2610, and ifstored, it advances to step 2603.

At step 2603, the control field 601 of the stored record 301 is read.

At step 2604, the record number 602 in the read-out control field iscompared with the record number 602 in the dummy control field 1000 orcontrol field 600 pointed by the update record pointer 807. If both therecord numbers 602 are not coincident, it means an error so that theprocess flow advances to step 2612. If both the record numbers 602 arecoincident, the process flow advances to step 2605.

At step 2605, the data field length 603 in the read-out control field601 is compared with the data field 603 in the dummy control field 100or control field 600 pointed by the update record pointer 807. If boththe data field length are not coincident, it means an error so that theprocess flow advances to step 2611. If coincident, the process flowadvances to step 2606.

At step 2606, the write-after data 160 are written in the track 300.

At step 2607, the update record pointer 807 having the next large recordnumber 5602 without a null value is searched. If a proper update recordpointer 807 cannot be searched, it means that all write-after records160 for the track 300 of concern have been written, so the process flowadvances to step 2613. If a proper update record pointer 807 can besearched, the process flow advances to step 2608.

At step 2608, it is checked if the distance to the record 301 pointed bythe searched update record pointer 807 is equal to or larger than apredetermined value. If the distance is smaller than the predeterminedvalue, the process flow returns back to step 2601 to again execute theabove-described processes for the record 301 pointed by the searchedupdate record pointer 308. If the distance is equal to or larger thanthe predetermined value, the process flow advances to step 2609.

At step 2609, the positioning request is issued to the disk unit 24 tothereafter intercept the write-after process. In this case, the recordnumber 602 of the record to be next written is set as the write-afterstart record number 2300, and necessary information of the segmentmanagement information 500 is updated.

At step 2610, the "record physical position inconsistent" information2301 is set to thereafter advance to step 2614.

At step 2611, the "field length inconsistent" information 1204 is set tothereafter advance to step 2614.

Steps 2612 to 2614 are similar to steps 1508 to 1510 shown in FIG. 17.At these steps 2612 to 2614, the "record number inconsistent"information 1203 is set, the segment management information 500 isupdated, and the write-after processing flag 1200 is reset,respectively.

FIG. 32 is a flow chart illustrating the processes to be executed by thewrite-after error decision part 13.

This process flow is executed when an input/output request is receivedfrom CPU 20 via the channel 22, similar to the process flow of the firstembodiment shown in FIG. 18.

At step 2700, it is checked if data are set in accordance with the"record number inconsistent" information 1203, "field lengthinconsistent" information 1204 or "record physical positioninconsistent" information 2301, respectively in the write-afterinformation 1100 of the disk unit 24 for which the input/output requestwas issued. If data are not being set for any of the information, theprocess flow is terminated. If data are being set for any one of theinformation, the process flow advances to step 2701.

At step 2701, an error is notified to CPU 20.

Next, the fourth embodiment will be described with reference to FIGS. 35to 41. According to the fourth embodiment, if the record 301 to bewritten is not being stored in the cache memory 26, the director 25makes a decision, in accordance with the information held by the controlunit 25, that the data are to be written in the cache memory 26 and thewrite process is completed at this stage. Moreover, the efficiency ofthe write-after process is intended to be improved by calculating thephysical write position on the track 300 of the record 301 to bewritten.

The information held by the control unit 23 is the informationrepresentative of whether each track 300 satisfies the conditions A toC.

FIG. 35 is a detailed block diagram showing the information processingsystem of this embodiment. The different points from the thirdembodiment shown in FIG. 26 are as follows.

First, the designated information 3500 from CPU 20 does not include thedesignated information 7.

Second, the write-after memory 27 stores the information representativeof whether or not each track 300 of the disk unit 24 satisfies theconditions A to C.

Third, the execution condition C 3410 is checked by the director usingthe information stored in the write-after memory 27.

The cache memory 26, directory 28, segment management information 500,track table 501, and empty segment queue head pointer 502 all have thesame structure as shown in FIGS. 6, 8, 27, 10 and 11, respectively.

FIG. 36 shows the structure of the write-after memory 27 of thisembodiment. The different point from the third embodiment shown in FIG.20 is as follows. Instead of the write-after track information a 1700,there is provided write-after track information b 2800 for each diskunit 24.

FIG. 37 shows the structure of the write-after track information b 2800.The write-after track information b 2800 includes the followinginformation provided for each track 300 of the disk unit 24.

Track state b 2900 . . . Information representative of whether or notthe track 300 in concern satisfies the conditions A to C, orrepresentative of that it is not certain whether the track 300 satisfiesthe conditions.

Fixed data field length information 2901 . . . Information of the lengthof the data field 601, the length being the same for all records 301 ifthe track 300 satisfies the conditions A to C.

FIG. 38 shows a state transition of the track state b 2900. Transitionbetween the states b 2900 is executed in a similar manner as the trackinformation a 1800 of the second embodiment shown in FIG. 22.Specifically, when a partial write request is received during a state401 that it is not certain whether the track 300 satisfies theconditions A to C, it is checked if the track 300 satisfies theconditions A to C, and the check result is stored in the track state b2900. When a format write request is received for the track 300, thetrack state b 2900 is set to the state 401 that it is not certainwhether the track 300 satisfies the conditions A to C.

The order of storage of the track information b 2900 and fixed datafield length information 2901 is in the order of track number, similarto the track information a 1800 of the second embodiment shown in FIG.22.

The structure of the director 25 is similar to the second embodimentshown in FIG. 23.

The process flows for the write-after schedule part 11, write-aftertransfer part 12, and write-after error decision part 13 are similar tothose of the third embodiment shown in FIGS. 30 to 32, respectively.However, the process flows for the cache partial write part 10,write-after track information management part a 14, and write-aftertrack information management part b 15 are different, so the descriptiontherefor will be given below.

FIG. 39 is a flow chart illustrating the processes to be executed by thecache partial write part 10. Similar to the process flow of the firstembodiment shown in FIG. 15, this process flow includes also a processfor the case where the record 301 to be written is already stored in thecache memory 26.

This process flow is executed when the director 25 receives a partialwrite request from CPU 20 via the channel 22, and the track state b 2900of the track to be written indicates the state 402 that the tracksatisfies the conditions A to C.

At step 3000, it is checked if the write data amount supplied from CPU20 is valid. In this embodiment, even if the segment 400 is notallocated to the track 300 to be written, it is possible to check thevalidity of the write data amount from the value in the fixed data fieldlength information 2901. If the write data amount is not valid, theprocess flow jumps to step 3011. If the write data amount is valid, itadvances to step 3001.

The processes at step 3001 and following steps are similar to theprocess flow shown in FIG. 29. Namely, steps 3001 to 3007 correspond tosteps 2400 to 2406 shown in FIG. 29, and steps 3008 to 3011 correspondto steps 2409 to 2412 shown in FIG. 29.

FIGS. 40A and 40B are flow charts illustrating the processes to beexecuted by the write-after track information management part. Thedifferent points from the process flows of the third embodiment shown inFIGS. 24A and 24B reside in that the process flows shown in FIGS. 24Aand 24B deal with the write-after track information a 1700, whereas theprocess flows shown in FIGS. 40A and 40B deal with the write-after trackinformation b 2800.

The process flow shown in FIG. 40A is executed at the time similar tothe process flow shown in FIG. 24A.

At step 3100, there is issued a positioning request for the track 300 tobe written.

The process flow shown in FIG. 40B is executed when the positioningrequest issued at step 3100 has been completed.

At step 3101, all records 301 on the track 300 to be written are read tocheck if the track satisfies the conditions A to C.

At step 3102, the check result at step 3101 is stored in the track stateb 2900 for the track 300. If the conditions A to C are satisfied, thelength of the data field 601 is set in the fixed data field lengthinformation 2901, to thereafter terminate the process flow.

FIG. 41 is a flow chart illustrating the processes to be executed by thewrite-after track information management part b 15. The differencebetween the process flow shown in FIG. 41 and the process flow of thethird embodiment shown in FIG. 25 is that the former flow deals with thewrite-after track information a 1700 whereas the latter flow deals withthe write-after track information b 2800.

The process flow shown in FIG. 41 is executed at the time similar to theprocess flow shown in FIG. 25.

At step 3200, the track state b 2900 of the track 300 to be written isreset to the state 401 that it is not certain if the track 300 satisfiesthe conditions A to C.

In the third and fourth embodiments, the continuity of positions ofrecords to be stored in the cache memory 26 has not been considered atall.

However, if there is introduced a restriction that records 301 on thetrack 300 at physically consecutive positions should be stored in thesegment also at physically consecutive positions, the cache control canbe executed in a more simple manner. Such a restriction is called aconsecutive storage restriction.

For example, as shown in FIG. 42, it is assumed that a record m 3600 anda record n 3601 are present on the track 300 at physically consecutivepositions. In such a case, it often occurs that CPU 20 requests toconsecutively read the record m 3600 and record n 3601 on the track 300at the physically consecutive positions. If the record m 3600 and recordn 3601 are stored in the segment 400 consecutively, the director 25 isallowed to simply read a certain area in the segment 400 and send thedata to CPU 20. Namely, in transferring the record n 3601 from thecontrol unit 23 to CPU 20, it is not necessary to execute a process ofreferring to the record pointer n 3603 of the segment managementinformation 500.

In order to be subject to the consecutive storage restriction, it issufficient if the director 25 is permitted to terminate the writeprocess when the data have been written in the cache memory 26, oncondition that the following consecutive storage conditions 1 to 3 aresatisfied.

Consecutive storage condition 1 . . . The record 301 on the track 300 tobe written is not being stored in the cache memory 26. The consecutivestorage restriction can be met in this case because the director 25stores a record k 4300 to be written in a newly established segment 400,as shown in FIG. 43A.

Consecutive storage condition 2 . . . The record 301 to be written isthe same record 301 already stored in the cache memory 26, while meetingthe consecutive storage restriction. The consecutive storage restrictioncan be met in this case because the data are written in an alreadystored record k 4300 to update the contents of the record, as shown inFIG. 43B.

Consecutive storage condition 3 . . . The record 301 to be written has arecord number 602 that is larger by 1 than the maximum record number ofthe record 301 on the track 300 already stored in the cache memory 26.In other words, the record number 602 of the record 301 to be written isconsecutive with that of the record 301 already stored in the cachememory 26. The consecutive storage restriction can be met in this casebecause the director 25 causes a record k 4300 to be stored in the areaafter the record 301 (. . . , k-1) is already stored in the segment 400,as shown in FIG. 43C.

The consecutive storage restriction is applicable both to the case whereCPU 20 supplies the information representative of whether the track 300to be written satisfies the conditions A to C (the third embodiment) andto the case where the control unit 23 holds for each track 300 theinformation representative of whether the track 300 to be writtensatisfies the conditions A to C (the fourth embodiment). When theconsecutive storage restriction is introduced, only the segmentmanagement information 500 changes.

FIG. 44 shows the structure of the segment management information 500introducing the consecutive storage restriction according to the fifthembodiment. The different point from the third embodiment shown in FIG.27 is that an intra-cache maximum record number 3700 is provided. Thisintra-cache maximum record number indicates the maximum record number602 of records 301 stored in the cache memory 26.

The process flows shown in FIGS. 29 to 32, and FIGS. 39 to 41 areapplicable to this embodiment, excepting that the process flows by thecache partial write part 10 shown in FIGS. 29 and 39 are executed atdifferent times. Namely, the process flows are executed when the track300 to be written satisfies the conditions A to C and the consecutivestorage conditions 1 to 3.

According to the cache control method and apparatus, even if the recordsubjected to a partial write process is not being stored in a cachememory, it is possible to terminate the write process at the time whenthe data have been written in the cache memory. Accordingly, speeding upthe write process using a cache memory is possible for a wide range ofapplications. Furthermore, the efficiency of the write process can beimproved by calculating the physical position of a record.

We claim:
 1. A cache control method executed by a control unit with acache memory connected with a storage unit for storing records, eachrecord having a respective record number, and said cache memory storingdata of frequently-accessed records of the storage unit, comprising thesteps of:(a) receiving from a data processing unit a write requestincluding a record number designating a record to be written; (b)receiving data to be written in said record from said data processingunit, regardless of whether said record is being stored in said cachememory; (c) storing said data received in step (b) into said cachememory without accessing said storage unit; (d) notifying said dataprocessing unit of a completion of said write request; (e) checkingwhether a record having said record number included in said writerequest exists in said storage unit or not; and (f) if said recordhaving said record number checked in step (e) exists, writing said datastored in said cache memory into said storage unit, and if not,notifying said data processing unit of an error.
 2. A cache controlmethod executed by a control unit with a cache memory connected with astorage unit for storing records, each record having a respectivecontrol field inclusive of a record number and at least another field,and said cache memory storing data of frequently-accessed records of thestorage unit, comprising the steps of:(a) receiving from a dataprocessing unit a write request including a record number fordesignating a record to be written, field information for designating afield other than a control field to be written in the designated record,and process mode information for designating a process mode to beexecuted when said designated record is not being stored in said cachememory; (b) receiving, from said data processing unit, data to bewritten in said designated field in accordance with said process modeinformation, regardless of whether the designated record is being storedin said cache memory; (c) storing said data received in step (b) intosaid cache memory without accessing said storage unit; and (d) notifyingsaid data processing unit of a completion of said write request.
 3. Acache control method according to claim 2, further comprising the stepsof:(e) finding a record having said record number included in said writerequest in said storage unit; (f) if said record having said recordnumber is found in step (e), writing said data stored in said cachememory into said found record of said storage unit; and (g) if saidrecord having said record number is not found in step (e), notifyingsaid data processing unit of such effect.
 4. A cache control methodaccording to claim 3, wherein said control field contains lengthinformation representative of the length of said field other than saidcontrol field;at said step (c), further storing the length of said datainto said cache memory; at said step (f), if said record having saidrecord number is found in step (e), comparing the length represented bysaid length information with the length stored into said cache memory atsaid step (c); if a result of said comparing step is that the comparedlengths are coincident, writing said data stored in said cache memory insaid found record, and if said result of said comparing step reveals nocoincidence of said compared lengths, notifying said data processingunit of error.
 5. A cache control method for a control unit for a cachememory connected with a storage unit having a plurality of physicalareas for storing records, each record having a control field inclusiveof a record number and at least another field, and said cache memorystoring data of frequently-accessed records of the storage unit, whereinsaid control unit holds, for each physical area, record format conditioninformation representative of whether a condition that there is noduplication in the record numbers of the records in the physical area issatisfied or not, comprising the steps of:(a) receiving from a dataprocessing unit a write request including a record number fordesignating a record to be written, physical area information fordesignating a physical area to be written, and field information fordesignating a field other than said control field to be written in therecord, and checking whether record format information for said physicalarea to be written satisfies said condition or not; (b) receiving, fromsaid data processing unit, data to be written in said designated fieldregardless of whether the designated record is being stored in saidcache memory; (c) storing said data received in step (b) into said cachememory without accessing said storage unit; and (d) notifying said dataprocessing unit of a completion of said write request.
 6. A cachecontrol method executed by a control unit with a cache memory connectedwith a storage unit having a plurality of physical areas for storingrecords, each record having a control field inclusive of a record numberand at least another field, and said cache memory storing data offrequently-accessed records of the storage unit, comprising the stepsof:(a) receiving from a data processing unit a write request including arecord number for designating a record to be written, field informationfor designating a field to be written in the designated record, andrecord format information representative of whether a physical areawhich includes the designated record satisfies a predetermined conditionthat a record number of the record at a start of said physical area is"0" and numbers of following records in said physical area are given inascending order each incremented by "1", each record in said physicalarea has one field other than said control field, a length of said onefield other than said control field is equal for each record having therecord number 1 or larger, and said one field other than said controlfield of the record having a record number 0 has a predetermined length;(b) receiving, from said data processing unit, data to be written insaid designated field regardless of whether the designated record isbeing stored in said cache memory, when the condition of said recordformat information is satisfied; (c) storing said data received in step(b) into said cache memory without accessing said storage unit; and (d)notifying said data processing unit of a completion of said writerequest.
 7. A cache control method according to claim 6, furthercomprising the steps of:(e) finding, in said storage unit, a recordhaving said record number included in said write request; (f) if saidrecord having said record number is found in step (e), writing said datafrom said cache memory to said record having said record number; and (g)if said record having said record number is not found in step (e),notifying said data processing unit of such effect.
 8. A cache controlmethod according to claim 7, wherein said control field contains lengthinformation representative of a length of said field other than saidcontrol field; and wherein:said step (c) further comprises the step ofstoring a length of said data into said cache memory; and said step (f)further comprises the steps of comparing the length represented by saidlength information with said length stored into said cache memory atsaid step (c); if the comparing step reveals that the compared lengthsare coincident, writing said data stored in said cache memory to saidrecord having said record number; and if the comparing step reveals thatthe compared lengths are not coincident, notifying such effect to saiddata processing unit.
 9. A cache control method according to claim 7,further comprising the step of:calculating, before said step (f), awrite position on said physical area of said record having said recordnumber included in said write request, based on said record conditionformat information, and wherein said step (f) further comprises thesteps of determining whether a relation between a write position of saidwriting into said record having said record number and said calculatedwrite position satisfies a predetermined condition; if the relationsatisfies the predetermined condition, writing said data stored in saidcache memory into said found record; and if the relation does notsatisfy said predetermined condition, notifying such effect to said dataprocessing unit.
 10. A cache control method according to claim 7,further comprising the step of:at said step (e), if there are aplurality of records to be written within the same physical area,finding the records to be written in the order of record number.
 11. Acache control method according to claim 6, further comprising the stepsof:(e) calculating a write position on said physical area of a recordhaving said record number included in said write request based on saidrecord condition format information; (f) finding a record having saidrecord number included in said write request within a predeterminedrange near said calculated write position; and (g) if said record havingsaid record number is found in step (f), writing said data from saidcache memory to said found record, and if not, notifying such effect tosaid data processing unit.
 12. A cache control method executed by acontrol unit with a cache memory connected with a storage unit having aplurality of physical areas for storing records, each record having acontrol field inclusive of a record number and at least another field,and said cache memory storing data of frequently-accessed records of thestorage unit, wherein said control unit holds, for each physical area,record format condition information representative of whether arespective physical area satisfies a predetermined condition that therecord number of the record at a start of said physical area is "0" andnumbers of following records in said physical area are given inascending order each incremented by "1", each record in the physicalarea has one field other than said control field, a length of said onefield other than said control field is equal for each record having therecord number 1 or larger, and said one field other than said controlfield of the record having the record number 0 has a predeterminedlength, comprising the steps of:(a) receiving from a data processingunit a write request including a record number for designating a record,and field information for designating a field other than said controlfield to be written in the designated record; (b) receiving, from saiddata processing unit, data to be written in said designated fieldregardless of whether the designated record is being stored in saidcache memory, in accordance with said record format conditioninformation representing that said predetermined condition is satisfied;(c) storing said data received in step (b) into said cache memorywithout accessing said storage unit; and (d) notifying said dataprocessing unit of a completion of said write request.
 13. A cachecontrol unit having a cache memory connected with a storage unit forstoring records, said cache memory storing data of frequently-accessedrecords of the storage unit, comprising:(a) write request receivingmeans for receiving from a data processing unit a write requestincluding a record number designating a record to be written; (b) datareceiving means for receiving, if said designated record is not beingstored in said cache memory, data to be written to said designatedrecord from said data processing unit; (c) data storing means forstoring said received data into said cache memory; (d) write requestcompletion notifying means for notifying said data processing unit of acompletion of said write request; (e) record presence checking means forchecking if a record having said record number included in said writerequest exists in said storage unit; (f) data writing means for writingsaid data stored in said cache memory to said record having said recordnumber included in said write request if said record having said recordnumber included in said write request exists in said storage unit; and(g) termination notifying means for notifying to said data processingunit if said record having said record number included in said writerequest does not exist in said storage unit.
 14. A cache control unithaving a cache memory connected with a storage unit for storing records,each record having a control field inclusive of a record number and atleast another field, and said cache memory storing data offrequently-accessed records of the storage unit, comprising:(a) writerequest receiving means for receiving from a data processing unit awrite request including a record number for designating a record to bewritten, field information for designating a field other than a controlfield to be written in the designated record, and process modeinformation for designating a process mode to be executed when saiddesignated record is not being stored in said cache memory; (b) datareceiving means for receiving, if the designated record is not beingstored in said cache memory, data to be written in said designated fieldfrom said data processing unit in accordance with said process modeappointed by said process information; (c) data storing means forstoring said received data into said cache memory; and (d) write requestcompletion notifying means for notifying said data processing unit of acompletion of said write request.
 15. A cache control unit according toclaim 14, further comprising:(f) record finding means for finding, aftersaid data from said data processing unit is stored in said cache memory,said record having said record number included in said write request;(g) data writing means for writing said data from said cache memory tosaid record having said record number, if said record having said recordnumber is found by said record finding means; and (h) terminationnotifying means for notifying said data processing unit if said recordhaving said record number is not found by said record finding means. 16.A cache control unit having a cache memory connected between a dataprocessing unit and a storage unit having a plurality of physical areasfor storing records, each record having a control field inclusive of arecord number and at least another field, and said cache memory storingdata of frequently-accessed records of the storage unit, comprising:(a)record format information holding means for holding, for each physicalarea, record format information representative of a condition of whetherthere is no duplicate record number of the record in the physical area;(b) write request receiving means for receiving from a data processingunit a write request including a record number for designating a record,and field information for designating a field other than a control fieldto be written in the designated record; (c) data receiving means forreceiving, if the designated record is not being stored in said cachememory, data to be written in said designated field from said dataprocessing unit in accordance with representing that said condition issatisfied or not; (d) data storing means for storing said data receivedby said data receiving means into said cache memory; and (e) writerequest completion notifying means for notifying said data processingunit of a completion of said write request.
 17. A cache control unithaving a cache memory connected with a storage unit having a pluralityof physical areas for storing records, each record having a controlfield inclusive of a record number and at least another field, and saidcache memory storing data of frequently-accessed records of the storageunit, comprising:(a) write request receiving means for receiving from adata processing unit a write request including a record number fordesignating a record to be written, field information for designating afield other than a control field to be written in said record to bewritten, and information representative of a condition that a recordnumber of a record at a start of the physical area for storing recordsis "0" and numbers of following records are given in ascending ordereach incremented by "1", each record has one field other than saidcontrol field, a length of said one field other than said control fieldis equal for each record having the record number 1 or larger, and saidone field other than said control field of the record having the recordnumber 0 has a predetermined length; (b) data receiving means forreceiving, if the designated record is not being stored in said cachememory, data to be written in said field to be written from said dataprocessing unit; (c) data storing means for storing said data receivedby said data receiving means into said cache memory; and (d) writerequest completion notifying means for notifying said data processingunit of a completion of said write request.
 18. A cache control unitaccording to claim 17, further comprising:(e) write position calculatingmeans for calculating a write position on said physical area of saiddesignated record; (f) record finding means for finding a record havingsaid record number included in said write request within a predeterminedrange near said write position; (g) data writing means for writing, ifsaid record having said record number is found by said record findingmeans, said data stored in said cache memory in said record; and (h)termination notifying means for notifying, if said record having saidrecord number is not found by said record finding means, to said dataprocessing unit that the comparison result does not satisfy saidpredetermined condition.
 19. A cache control unit having a cache memoryconnected with a storage unit having a plurality of physical areas forstoring records, each record having a control field inclusive of arecord number, and said cache memory storing data of frequently-accessedrecords of the storage unit, comprising:(a) structural conditioninformation holding means for holding, for each physical area, recordformat information representative of a condition of whether a recordnumber of the record at a start of the physical area for storing recordsis "0" and numbers of following records are given in ascending ordereach incremented by "1" each record has one field other than saidcontrol field, a length of said one field other than said control fieldis equal for each record having the record number 1 or larger, and saidone field other than said control field of the record having the recordnumber 0 has a predetermined length; (b) write request receiving meansfor receiving from a data processing unit a write request including arecord number for designating a record to be written, and fieldinformation for designating a field other than a control field to bewritten in the designated record; (c) data receiving means forreceiving, if the designated record is not being stored in said cachememory, said record format information representing whether saidcondition is satisfied or not, in accordance with data to be written inthe appointed field from said data processing unit; (d) data storingmeans for storing said data received by said receiving means into saidcache memory; and (e) write request completion notifying means fornotifying said data processing unit of a completion of said writerequest.
 20. A cache control unit according to claim 19, furthercomprising:(f) write position calculating means for calculating a writeposition on said physical area of the designated record; (g) recordfinding means for finding a record having said record number included insaid write request within a predetermined range near said writeposition; (h) data writing means for writing, if said record having saidrecord number is found by said record finding means, said data stored insaid cache memory in said record; and (i) termination notifying meansfor notifying, if said record inclusive of said record number is notfound by said record finding means, to said data processing unit thatthe designated record is not found.